Finding Minima in Complex Landscapes: Annealed, Greedy and Reluctant Algorithms
نویسندگان
چکیده
We consider optimization problems for complex systems in which the cost function has a multivalleyed landscape. We introduce a new class of dynamical algorithms which, using a suitable annealing procedure coupled with a balanced greedy-reluctant strategy drive the systems towards the deepest minimum of the cost function. Results are presented for the Sherrington-Kirkpatrick model of spin-glasses.
منابع مشابه
Parallelism and Greedy Algorithms
A number of greedy algorithms are examined <and are shown to be probably inherently sequential. Greedy algorithms are presented for finding a maximal path, for finding a . maximal set of disjoint paths in a layered dag, and for finding the largest induced subgraph of a graph that has all vertices of degree at least Ic. It is shown that for all of these algorithms, the problem of determining if ...
متن کاملInterpolating greedy and reluctant algorithms
In a standard NP-complete optimization problem we introduce an interpolating algorithm between the quick decrease along the gradient (greedy dynamics) and a slow decrease close to the level curves (reluctant dynamics). We find that for a fixed elapsed computer time the best performance of the optimization is reached at a special value of the interpolation parameter, considerably improving the r...
متن کاملProbabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets
We consider a natural parallel version of the classical greedy algorithm for finding a maximal independent set in a graph. This version was studied in Coppersmith, Rhagavan and Tompa [CRT] and they conjecture there that its expected running time on random graphs of arbitrary edge density is O(logn). We prove that conjecture.
متن کامل2 2 Ja n 20 03 Energy - Decreasing Dynamics in Mean - Field Spin Models
We perform a statistical analysis of deterministic energy-decreasing algorithms on mean-field spin models with complex energy landscape like the Sine model and the Sherrington Kirkpatrick model. We specifically address the following question: in the search of low energy configurations is it convenient (and in which sense) a quick decrease along the gradient (greedy dynamics) or a slow decrease ...
متن کاملHow Good are Genetic Algorithms at Finding Large Cliques: An Experimental Study
This paper investigates the power of genetic algorithms at solving the MAX-CLIQUE problem. We measure the performance of a standard genetic algorithm on an elementary set of problem instances consisting of embedded cliques in random graphs. We indicate the need for improvement, and introduce a new genetic algorithm, the multi-phase annealed GA, which exhibits superior performance on the same pr...
متن کامل